traversal time problem ∗

نویسنده

  • G. Iannaccone
چکیده

The theory of weak measurement, proposed by Aharonov and coworkers, has been applied by Steinberg to the long-discussed traversal time problem. The uncertainty and ambiguity that characterize this concept from the perspective of von Neumann measurement theory apparently vanish, and joint probabilities and conditional averages become meaningful concepts. We express the Larmor clock and some other well-known methods in the weak measurement formalism. We also propose a method to determine higher moments of the traversal time distribution in terms of the outcome of a gedanken experiment, by introducing an appropriate operator. Since the weak measurement approach can sometimes lead to unphysical results, for example average negative reflection times and higher moments, the interpretation of the results obtained remains an open problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An improved algorithm to reconstruct a binary tree from its inorder and postorder traversals

It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...

متن کامل

An improved algorithm to reconstruct a binary tree from its inorder and postorder traversals

It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...

متن کامل

cient Substring Traversal with Su x Arrays

The substring traversal problem is the problem of enumerating all branching substrings appearing in a given text. Although this problem is easily solvable with the su x tree of McCreight (1976), a space e cient and practically fast solution is important. We devise a simple and e cient algorithm that simulates the traversal of the su x tree for a given text with the su x array of Manber and Meye...

متن کامل

Emmanuelle Encrenaz and Laurent Fribourg Time Separation of Events : An Inverse Method Research

The problem of “time separation” can be stated as follows: Given a system made of several connected components, each one entailing a local delay known with uncertainty, what is the maximum time for traversing the global system? This problem is useful, e.g. in the domain of digital circuits, for determining the global traversal time of a signal from the knowledge of bounds on the component propa...

متن کامل

Clustering for Improved Learning in Maze Traversal Problem

The maze traversal problem (finding the shortest distance to the goal from any position in a maze) has been an interesting challenge in computational intelligence. Recent work has shown that the cellular simultaneous recurrent neural network (CSRN) can solve this problem for simple mazes. This thesis focuses on exploiting relevant information about the maze to improve learning and decrease the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996